منابع مشابه
NP-Completeness of Some Tree-Clustering Problems
A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-complete. Moreover, if the length of the paths (cycles) is bounded by a constant, the problem is in P.
متن کاملMinimizing the overhead for some tree-scheduling problems
This paper is devoted to the study of tree-scheduling problems within the execution model described by Anderson, Beame and Ruzzo. We first prove the NP-completeness of the problem of minimizing the overhead for scheduling trees on m processors, and then we propose an algorithm that provides optimal schedules when complete trees are considered.
متن کاملApproximation Algorithms for Some Optimum Communication Spanning Tree Problems
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning tree (PROCT) problem is to nd a spanning tree T minimizing ∑ u; v∈ V r(u)r(v)dT (u; v), where dT (u; v) is the length of the path between u and v on T . The optimal sum-requirement communication spanning tree (SROCT) pr...
متن کاملReview of Skidding Problems at Navy Airfields 1 Review of Work Conducted on Friction Coefficient 2
A review of the problem of aircraft skidding on Naval airfields during landings and a thorough literature search on the work conducted on friction coefficient were made. The literature search revealed that much ,vork has been conducted on basic theoretical studies of friction coefficient, on development of friction measuring devices, and on investigations to determine the factors which affect t...
متن کاملSome Perspectives of Machine Repair Problems
In this article, we survey machine repair problems (MRP) with an emphasis on historical developments of queuing models of practical importance. The survey proceeds historically, starting with developments in 1985, when the first published review on machine interference models appeared. We attempt to elaborate some basic MRP models of the real life congestion situations. The brief survey of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Resources and Technology
سال: 2019
ISSN: 2307-0048
DOI: 10.15393/j2.art.2019.4422